Minimal-variance distributed scheduling under strict demands and deadlines
نویسندگان
چکیده
منابع مشابه
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
In the design of distributed computer systems, the scheduling problem is considered to be an important one and has been addressed by many researchers. However, most approaches have not dealt with tasks' timing and resource requirements. In this paper, we describe a set of heuristic algorithms to schedule tasks that have deadlines and resource requirements, in a distributed system. These algorit...
متن کاملEnd-to-End Scheduling to Meet Deadlines in Distributed Systems
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as end-to-end release-times and deadlines. This paper describes algorithms to schedule a class of systems where all the tasks execute on different processors in turn in the same order. This end-to-end scheduling problem is...
متن کاملNetwork Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملOnline Scheduling with Hard Deadlines
We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be star...
متن کاملConditional Scheduling with Varying Deadlines
We examine a conditional scheduling model in which the deadlines of jobs are allowed to vary. We explore variants of the basic model and locate the dividing line between NP-hard and polynomial-time problems. Suppose that an engineer needs to design one of two devices, either A or B. Each device will require nine months of work. The due date of both A and B is in one year, but only one device wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2019
ISSN: 0163-5999
DOI: 10.1145/3305218.3305224